Fiche membre | Laboratoire des Sciences du Numérique de Nantes

Fiche membre Retour à l'annuaire

Alexandre GOLDSZTEJN

CHERCHEUR

Chargé de recherche CNRS

: Alexandre.Goldsztejnatls2n.fr

Page pro : www.goldsztejn.com

Adresse :

Centrale Nantes ( CN )
Petit Port
1, rue de la Noë
BP 92101
44321 NANTES Cedex 3

Batiment S, étage 4, bureau 414

Publications référencées sur HAL

Revues internationales avec comité de lecture (ART_INT)

[1] R. Garcia, A. Volkova, M. Kumm, A. Goldsztejn, J. Kühle. Hardware-aware Design of Multiplierless Second-Order IIR Filters with Minimum Adders. In IEEE Transactions on Signal Processing ; éd. Institute of Electrical and Electronics Engineers, 2022, vol. 70.
https://hal.science/hal-03208221v3

[2] S. Briot, A. Goldsztejn. Singularity Conditions for Continuum Parallel Robots. In IEEE Transactions on Robotics ; éd. IEEE, 2022, vol. 38, num. 1.
https://hal.science/hal-03210572

[3] A. Colotti, D. Monnet, A. Goldsztejn, F. Plestan. New convergence conditions for the super twisting algorithm with uncertain input gain. In Automatica ; éd. Elsevier, 2022, vol. 143.
https://hal.science/hal-03868734

[4] D. Monnet, A. Goldsztejn, F. Plestan. Generalization of the twisting convergence conditions to non-affine systems. In Automatica ; éd. Elsevier, 2021.
https://hal.science/hal-03504857

[5] A. Marendet, A. Goldsztejn, G. Chabert, C. Jermann. A standard branch-and-bound approach for nonlinear semi-infinite problems. In European Journal of Operational Research ; éd. Elsevier, 2020, vol. 282, num. 2.
https://hal.science/hal-02415459

[6] A. Koessler, A. Goldsztejn, S. Briot, N. Bouton. Dynamics-based Algorithm for Reliable Assembly Mode Tracking in Parallel Robots. In IEEE Transactions on Robotics ; éd. IEEE, 2020, vol. 36, num. 3.
https://hal.science/hal-02539443

[7] A. Goldsztejn, G. Chabert. Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation. In Automatica ; éd. Elsevier, 2019, vol. 100.
https://hal.science/hal-01333216v2

[8] S. Briot, A. Goldsztejn. Topology Optimization of Industrial Robots: Application to a Five-bar Mechanism. In Mechanism and Machine Theory ; éd. Elsevier, 2018, vol. 120.
https://hal.science/hal-01587979

[9] A. Goldsztejn, F. Domes. A branch and bound algorithm for quantified quadratic programming. In Journal of Global Optimization ; éd. Springer Verlag, 2017, vol. 68, num. 1.
https://hal.science/hal-01730670

[10] B. Martin, A. Goldsztejn, L. Granvilliers, C. Jermann. Constraint propagation using dominance in interval Branch & Bound for nonlinear biobjective optimization. In European Journal of Operational Research ; éd. Elsevier, 2017, vol. 260, num. 3.
https://hal.science/hal-01401321

[11] H. Purohit, A. Goldsztejn, F. Goualard, L. Granvilliers, C. Jermann, R. Jeyasenthil, P. Nataraj, B. Patil. Simultaneous automated design of structured QFT controller and prefilter using nonlinear programming. In International Journal of Robust and Nonlinear Control ; éd. Wiley, 2017, vol. 27, num. 15.
https://hal.science/hal-01408593

[12] A. Goldsztejn, S. Caro, G. Chabert. A Three-step Methodology for Dimensional Tolerance Synthesis of Parallel Manipulators. In Mechanism and Machine Theory ; éd. Elsevier, 2016, vol. 105.
https://hal.science/hal-01721237

[13] D. Ishii, N. Yonezaki, A. Goldsztejn. Monitoring Temporal Properties Using Interval Analysis. In IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences ; éd. Institute of Electronics, Information and Communication Engineers, 2016, vol. E99.A, num. 2.
https://hal.science/hal-02490672

[14] A. Goldsztejn, D. Ishii. A Parallelotope Method for Hybrid System Simulation. In Reliable Computing electronic edition, vol. 23. 07-2016
https://hal.science/hal-02938568

[15] D. Ishii, N. Yonezaki, A. Goldsztejn. Monitoring Bounded LTL Properties Using Interval Analysis. In Electronic Notes in Theoretical Computer Science ; éd. Elsevier, 2015, vol. 317.
https://hal.science/hal-02488309

[16] A. Goldsztejn, C. Jermann, V. Ruiz de Angulo, C. Torras. Variable symmetry breaking in numerical constraint problems. In Artificial Intelligence ; éd. Elsevier, 2015, vol. 229.
https://hal.science/hal-01408594

[17] M. Tannous, S. Caro, A. Goldsztejn. Sensitivity Analysis of Parallel Manipulators Using an Interval Linearization Method. In Mechanism and Machine Theory ; éd. Elsevier, 2014, vol. 71.
https://hal.science/hal-00910915

[18] A. Goldsztejn, J. Cruz, E. Carvalho. Convergence analysis and adaptive strategy for the certified quadrature over a set defined by inequalities. In Journal of Computational and Applied Mathematics ; éd. Elsevier, 2014.
https://hal.science/hal-00911289

[19] B. Martin, A. Goldsztejn, L. Granvilliers, C. Jermann. On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach. In Journal of Global Optimization ; éd. Springer Verlag, 2014, vol. 64, num. 1.
https://hal.science/hal-01408595

[20] S. Caro, D. Chablat, A. Goldsztejn, D. Ishii, C. Jermann. A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots. In Artificial Intelligence ; éd. Elsevier, 2014, vol. 211.
https://hal.science/hal-00971348

[21] B. Martin, A. Goldsztejn, L. Granvilliers, C. Jermann. Certified Parallelotope Continuation for One-Manifolds. In SIAM Journal on Numerical Analysis ; éd. Society for Industrial and Applied Mathematics, 2013, vol. 51, num. 6.
https://hal.science/hal-01408525

[22] A. Goldsztejn. Modal Intervals Revisited Part 1: A Generalized Interval Natural Extension. In Reliable Computing electronic edition, vol. 16. 2012
https://hal.science/hal-00832813

[23] A. Goldsztejn. Modal Intervals Revisited Part 2: A Generalized Interval Mean-Value Extension. In Reliable Computing electronic edition, vol. 16. 2012
https://hal.science/hal-00832810

[24] D. Ishii, A. Goldsztejn, C. Jermann. Interval-Based Projection Method for Under-Constrained Numerical Systems. In Constraints ; éd. Springer Verlag, 2012, vol. 17, num. 4.
https://hal.science/hal-00868023

[25] A. Goldsztejn, W. Hayes, P. Collins. Tinkerbell Is Chaotic. In SIAM Journal on Applied Dynamical Systems ; éd. Society for Industrial and Applied Mathematics, 2011, vol. 10, num. 4.
https://hal.science/hal-00835176

[26] A. Goldsztejn, Y. Lebbah, C. Michel, M. Rueher. Capabilities of Constraint Programming in Safe Global Optimization. In Reliable Computing electronic edition, vol. 15, num. 1. 2011
https://hal.science/hal-00835183

[27] A. Goldsztejn, L. Jaulin. Inner approximation of the range of vector-valued functions. In Reliable Computing ; éd. Springer Verlag, 2010.
https://hal.science/hal-00518507

[28] A. Goldsztejn, M. Rueher, M. Claude. Efficient Handling of Universally Quantified Inequalities. In Constraints ; éd. Springer Verlag, 2009, vol. 14, num. 1.
https://hal.science/hal-00431129

[29] A. Goldsztejn, L. Granvilliers. A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions. In Constraints ; éd. Springer Verlag, 2009, vol. 15, num. 2.
https://hal.science/hal-00481066

[30] J. Normand, A. Goldsztejn, M. Christie, F. Benhamou. A Branch and Bound Algorithm for Numerical MAX-CSP. In Constraints ; éd. Springer Verlag, 2009, vol. 15, num. 2.
https://hal.science/hal-00481068

[31] A. Goldsztejn. Comparison of the Hansen-Sengupta and the Frommer-Lang-Schnurr Existence Tests. In Computing ; éd. Springer Verlag, 2007, vol. 79, num. 1.
https://hal.science/hal-00431164

[32] G. Chabert, A. Goldsztejn. Extension of Hansen-Bliek's Method to Right-Quantified Linear Systems. In Reliable Computing ; éd. Springer Verlag, 2007, vol. 13, num. 4.
https://hal.science/hal-00431161

[33] A. Goldsztejn. A Right-Preconditioning Process for the Formal-Algebraic Approach to Inner and Outer Estimation of AE-solution Set. In Reliable Computing ; éd. Springer Verlag, 2005, vol. 11, num. 6.
https://hal.science/hal-00431165

Conférences internationales avec comité de lecture et actes (COMM_INT)

[34] R. Garcia, A. Volkova, A. Goldsztejn. A New Model for the Multiple Constant Multiplication Problem. In 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, février 2022, Villeurbanne - Lyon, France.
https://hal.science/hal-03596159

[35] S. Briot, A. Goldsztejn. Singularity Conditions for Continuum Parallel Robots. In 2022 IEEE International Conference on Robotics and Automation (ICRA 2022), mai 2022, Philadelphia, états-Unis.
https://hal.science/hal-03551456

[36] A. Colotti, A. Goldsztejn. Practical stability and attractors of systems with bounded perturbations. In 2022 IEEE 61st Conference on Decision and Control (CDC), décembre 2022, Cancun, Mexique.
https://hal.science/hal-03957165

[37] D. Monnet, A. Goldsztejn, F. Plestan, C. Audet. Second order sliding mode twisting controller tuning based on two-level optimization process. In Conference on Decision and Control, décembre 2022, Cancun, Mexique.
https://hal.science/hal-03963726

[38] G. Jeanneau, V. Begoc, S. Briot, A. Goldsztejn. R-Min: a Fast Collaborative Underactuated Parallel Robot for Pick-and-Place Operations. In IEEE 2020 International Conference on Robotics and Automation (ICRA 2020), mai 2020, Paris, France.
https://hal.science/hal-02491783

[39] S. Rohou, A. Bedouhene, G. Chabert, A. Goldsztejn, L. Jaulin, B. Neveu, V. Reyes, G. Trombettoni. Towards a Generic Interval Solver for Differential-Algebraic CSP. In CP 2020 - 26th International Conference on Principles and Practice of Constraint Programming, septembre 2020, Louvain-la-Neuve, Belgique.
https://ensta-bretagne.hal.science/hal-02956402

[40] A. Colotti, A. Cenedese, S. Briot, I. Fantoni, A. Goldsztejn. Stability Analysis and Reconfiguration Strategy for Multi-agent D-formation Control. In 23rd CISM IFToMM Symposium on Robot Design, Dynamics and Control (RoManSy 2020), septembre 2020, Sapporo, Japon.
https://hal.science/hal-02849991

[41] A. Goldsztejn, G. Chabert. Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation. In The 18th International Symposium on Scientific Computing, Computer Arithmetic, and Verified Numerical Computations, septembre 2018, Tokyo, Japon.
https://hal.science/hal-02008057

[42] A. Goldsztejn, S. Caro, G. Chabert. A parametric Kantorovich theorem with application to tolerance synthesis. In The 18th International Symposium on Scientific Computing, Computer Arithmetic, and Verified Numerical Computations, septembre 2018, Tokyo, Japon.
https://hal.science/hal-01863731

[43] G. Chabert, A. Goldsztejn, C. Jermann. Solving under-constrained numerical constraint satisfaction problems with IBEX. In The 18th International Symposium on Scientific Computing, Computer Arithmetic, and Verified Numerical Computations, septembre 2018, Tokyo, Japon.
https://hal.science/hal-02008026

[44] S. Briot, A. Goldsztejn. Topology Optimization of a Reactionless Four-bar Linkage. In 7th IFToMM International Workshop on Computational Kinematics (CK2017), mai 2017, Poitiers, France.
https://hal.science/hal-01479410

[45] A. Koessler, A. Goldsztejn, S. Briot, N. Bouton. Certified Detection of Parallel Robot Assembly Mode under Type 2 Singularity Crossing Trajectories. In 2017 IEEE International Conference on Robotics and Automation (ICRA 2017), mai 2017, Singapour, Singapour.
https://hal.science/hal-01435808

[46] A. Goldsztejn, D. Ishii. HySIA: Tool for Simulating and Monitoring Hybrid Automata Based on Interval Analysis. In The 17th International Conference on Runtime Verification, septembre 2017, Seatle, états-Unis.
https://hal.science/hal-01731569

[47] A. Goldsztejn, G. Chabert, S. Caro. A New Methodology for Tolerance Synthesis of Parallel Manipulators. In IFToMM 2015, 2015, Taipei, Taïwan.
https://hal.science/hal-01238717

[48] A. Goldsztejn, F. Goualard, L. Granvilliers, C. Jermann, R. Jeyasenthil, P. Nataraj, B. Patil, H. Purohit. Robust controller and pre-filter design using QFT and interval constraint techniques. In International workshop on constraint programming and decision making workshop (CoProd), 2014, Unknown, région indéterminée.
https://hal.science/hal-01408596

[49] I. Salas, G. Chabert, A. Goldsztejn. The Non-overlapping Constraint between Objects Described by Non-linear Inequalities. In The 20th International Conference on Principles and Practice of Constraint Programming, septembre 2014, Lyon, France.
https://hal.science/hal-01084612v2

[50] A. Goldsztejn, L. Granvilliers, C. Jermann. Constraint Based Computation of Periodic Orbits of Chaotic Dynamical Systems. In 19th International Conference on Principles and Practice of Constraint Programming (CP'13), 2013, , Suède.
https://hal.science/hal-00867986

[51] B. Martin, A. Goldsztejn, C. Jermann, L. Granvilliers. On continuation methods for non-linear multi-objective optimization. In International conference on multiple criteria decision making (MCDM), 2013, Unknown, région indéterminée.
https://hal.science/hal-01408597

[52] B. Martin, A. Goldsztejn, L. Granvilliers, C. Jermann. Méthode de continuation par parallélépipèdes : application à l'optimisation globale continue bi-objectif. In Congrès annuel de la société française de recherche opérationnelle et d'aide à la décision (ROADEF), 2012, Unknown, région indéterminée.
https://hal.science/hal-01408599

[53] D. Ishii, A. Goldsztejn, C. Jermann. Interval-based projection method for under-constrained numerical csps. In Annual meeting of JSSST, 2012, Unknown, région indéterminée.
https://hal.science/hal-01408600

[54] S. Caro, D. Chablat, A. Goldsztejn, D. Ishii, C. Jermann. A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots. In 18th international conference on Principles and Practice of Constraint Programming, 2012, Québec City, Canada.
https://hal.science/hal-02005023

[55] A. Goldsztejn, C. Jermann, V. Ruiz de Angulo, C. Torras. Symmetry Breaking in Numeric Constraint Problems. In 17th International Conference on Principles and Practice of Constraint Programming (CP'11), 2011, , Italie.
https://hal.science/hal-00868237

[56] A. Goldsztejn, C. Jermann, V. Ruiz de Angulo, C. Torras. Symmetry Breaking in Numeric Constraint Problems. In 17th international conference on Principles and practice of constraint programming, 2011, Perugia, Italie.
https://hal.science/hal-00835280

[57] A. Goldsztejn, F. Goualard. Box consistency through Adaptive Shaving. In 25th Symposium On Applied Computing, mars 2010, Sierre, Suisse.
https://hal.science/hal-00428678

[58] N. Berger, R. Soto, A. Goldsztejn, S. Caro, P. Cardou. Finding the Maximal Pose Error in Robotic Mechanical Systems Using Constraint Programming. In The Twenty Third International Conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems (IEA-AIE 2010), juin 2010, Cordoba, Espagne.
https://hal.science/hal-00462935

[59] A. Goldsztejn, O. Mullier, D. Eveillard, H. Hosobe. Including Ordinary Differential Equations Based Constraints in the Standard CP Framework. In Principles and Practice of Constraint Programming, CP2010, septembre 2010, St Andrews, Royaume-Uni.
https://nantes-universite.hal.science/hal-00520054

[60] R. Chenouard, A. Goldsztejn, C. Jermann. Search Strategies for an Anytime Usage of the Branch and Prune Algorithm. In International Joint Conference on Artificial Intelligence, 2009, , états-Unis.
https://hal.science/hal-00421506

[61] D. Ishii, K. Ueda, H. Hosobe, A. Goldsztejn. Interval-based Solving of Hybrid Constraint Systems. In 3rd IFAC Conference on Analysis and Design of Hybrid Systems, septembre 2009, , Espagne.
https://hal.science/hal-00481169

[62] A. Goldsztejn, C. Michel, M. Rueher. An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities. In ACM symposium on Applied computing, mars 2008, Fortaleza, Ceara, Brésil.
https://hal.science/hal-00297250

[63] J. Normand, A. Goldsztejn, M. Christie, F. Benhamou. A Branch and Bound Algorithm for Numerical MAX-CSP. In The 14th International Conference on Principles and Practice of Constraint Programming, septembre 2008, , Australie.
https://hal.science/hal-00481180

[64] C. Pieter, A. Goldsztejn. The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems. In Second Workshop on Reachability Problems in Computational Models, septembre 2008, , Royaume-Uni.
https://hal.science/hal-00431183

[65] A. Goldsztejn, Y. Lebbah, C. Michel, M. Rueher. Constraint Programming and Safe Global Optimization. In SCAN 2008, 3th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Verified Numerical Computations, septembre 2008, El Paso, TX, états-Unis.
https://hal.science/hal-00510305

[66] A. Goldsztejn, L. Granvilliers. A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions. In CP, 2008, , France.In P. J. Stuckey (éds.), Proceedings of 14th International Conference on Principles and Practice of Constraint Programming. Springer, 2008.
https://hal.science/hal-00480819

[67] F. Goualard, A. Goldsztejn. A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations. In Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT '08), 2008, Dunedin, Nouvelle-Zélande.In IEEE computer Society (éds.), Procs. of the Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT '08). IEEE computer Society, 2008.
https://hal.science/hal-00288207

[68] A. Goldsztejn, Y. Lebbah, C. Michel, M. Rueher. Revisiting the upper bounding process in a safe Branch and Bound algorithm. In 14th International Conference on Principles and Practice of Constraint Programming, septembre 2008, Sydney, Australie.In P.J. Stuckey (éds.), Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming. , 2008.
https://hal.science/hal-00297086

[69] A. Goldsztejn. A branch and prune algorithm for the approximation of non-linear AE-solution sets. In 21st Annual ACM Symposium on Applied Computing, avril 2006, , France.
https://hal.science/hal-00481391

[70] A. Goldsztejn, G. Chabert. A Generalized Interval LU Decomposition for the Solution of Interval Linear Systems. In Sixth International Conference on Numerical Methods and Applications, août 2006, , Bulgarie.
https://hal.science/hal-00481290

[71] A. Goldsztejn, L. Jaulin. Inner and Outer Approximations of Existentially Quantified Equality Constraints. In Twelfth International Conference on Principles and Practice of Constraint Programming, septembre 2006, , France.
https://hal.science/hal-00481288

[72] A. Goldsztejn, G. Chabert. On the approximation of linear AE-solution sets. In 12th GAMM - IMACS International Symposion on Scientific Computing, Computer Arithmetic and Validated Numerics, septembre 2006, , Allemagne.
https://hal.science/hal-00481284

[73] A. Goldsztejn, W. Hayes. Rigorous Inner Approximation of the Range of Functions. In 12th GAMM - IMACS International Symposion on Scientific Computing, Computer Arithmetic and Validated Numerics, septembre 2006, , Allemagne.
https://hal.science/hal-00481215

[74] A. Goldsztejn, D. Daney, M. Rueher, P. Taillibert. Modal intervals revisited : a mean-value extension to generalized intervals. In In International Workshop on Quantification in Constraint Programming (International Conference on Principles and Practice of Constraint Programming, CP-2005), octobre 2005, Barcelona, Espagne.
https://inria.hal.science/hal-00990048

Conférences nationales avec comité de lecture et actes (COMM_NAT)

[75] I. Salas, G. Chabert, A. Goldsztejn. Contrainte de non-chevauchement entre objets décrits par des inégalités non-linéaires. In Journées Francophones de Programmation par Contraintes (JFPC), juin 2014, Angers, France.
https://hal.science/hal-01079579

[76] A. Goldsztejn, W. Hayes. A New Containment Method For Rigorous Shadowing. In International Conference on SCIentific Computation And Differential Equations, juillet 2009, , France.
https://hal.science/hal-00481202

[77] M. Rueher, A. Goldsztejn, Y. Lebbah, C. Michel. Capabilities of Constraint Programming in Rigorous Global Optimization. In 2008 International Symposium on Nonlinear Theory and its Applications, septembre 2008, , Hongrie.
https://hal.science/hal-00481388

[78] A. Goldsztejn, C. Michel, M. Rueher. An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities. In JFPC 2008- Quatrièmes Journées Francophones de Programmation par Contraintes, juin 2008, Nantes, France.In Gilles Trombettoni (éds.), . , 2008.
https://inria.hal.science/inria-00293749

Ouvrages - Chapitres d‘ouvrages et directions d‘ouvrages (OUV)

[79] C. Grandón, A. Goldsztejn. Quantifier Elimination versus Generalized Interval Evaluation: a Comparison on a Specific Class of Quantified Constraint. In Uncertainty and Intelligent Information Systems. 01-07-2008
https://hal.science/hal-00431188

Theses et HDR (THESE)

[80] A. Goldsztejn. Definition et Applications des Extensions des Fonctions Reelles aux Intervalles Généralisés; reformulation de la theorie des intervalles modaux.. Thèses : Université Nice Sophia Antipolis.
https://theses.hal.science/tel-00011922

Autres publications (AUTRES)

[81] R. Garcia, A. Volkova, A. Goldsztejn. Design of optimal multiplierless digital filters. Rapport technique, 2020 ; Université de Nantes.
https://hal.science/hal-03940617